Probabilistic Timed Automata with Clock-Dependent Probabilities

Probabilistic timed automata are classical extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic automata, a variant of in which transition probabilities can depend linearly on clock values. Clock-dependent allow the modelling continuous relationship between time passage and likelihood system events. show that problem deciding whether maximum reaching certain location is above threshold undecidable for automata. On positive side, we minimum be approximated using region-graph-based approach.